19.6 A 0.27V 30MHz 17.7nJ/transform 1024-pt Complex FFT Core with Super-Pipelining
نویسندگان
چکیده
Recently, aggressive voltage scaling was shown as an important technique in achieving highly energy-efficient circuits. Specifically, scaling Vdd to near or subthreshold regions was proposed for energy-constrained sensor systems to enable long lifetime and small system volume [1][2][4]. However, energy efficiency degrades below a certain voltage, Vmin, due to rapidly increasing leakage energy consumption, setting a fundamental limit on the achievable energy efficiency. In addition, voltage scaling degrades performance and heightens delay variability due to large Id sensitivity to PVT variations in the ultra-low voltage (ULV) regime. This paper uses circuit and architectural methods to further reduce the minimum energy point, or Emin, and establish a new lower limit on energy efficiency, while simultaneously improving performance and robustness. The approaches are demonstrated on an FFT core in 65nm CMOS.
منابع مشابه
Design and Implementation of a 1024-point Pipeline FFT Processor
Design and implementation of a 1024-point pipeline FFT processor is presented. The architecture is based on a new form of FFT, the r a d i ~ 2 ~ algorithm. By exploiting the spatial regularity of the new algorithm, minimal requirement for both dominant components in PLSI implementation has been achieved: only 4 complex multipliers and 1024 complex-word data memory for the pipelined 1K FFT proce...
متن کاملNew Integer-FFT Multiplication Architectures and Implementations for Accelerating Fully Homomorphic Encryption
This paper proposes a new hardware architecture of Integer-FFT multiplier for super-size integer multiplications. Firstly, a basic hardware architecture, with the feature of low hardware cost, of the Integer-FFT multiplication algorithm using the serial FFT architecture, is proposed. Next, a modified hardware architecture with a shorter multiplication latency than the basic architecture is pres...
متن کاملDesign of 2w4wsk-point Fft Processor Based on Cordic Algorithm in Ofdm Receiver
In this paper, the architecture and the implementation of a 2K/4K/SK-point complex fast Fourier transform (FFT) processor for OFDM system are presented. The processor can perform 8K-point FFT every 273p , and 2K-point every 68.26~s at 30MHz which is enough for OFDM symbol rate. The architecture is based on the Cooley-Tukey algorithm for decomposing the long DFT into short length multi-dimension...
متن کاملA Low-Power, High-Performance, 1024-Point FFT Processor
This paper presents an energy-efficient, single-chip, 1024-point fast Fourier transform (FFT) processor. The 460 000transistor design has been fabricated in a standard 0.7 m (Lpoly = 0:6 m) CMOS process and is fully functional on firstpass silicon. At a supply voltage of 1.1 V, it calculates a 1024-point complex FFT in 330 s while consuming 9.5 mW, resulting in an adjusted energy efficiency mor...
متن کاملA CORDIC processor for FFT computation and its implementation using gallium arsenide technology
In this paper, the architecture and the implementation of a complex fast Fourier transform (CFFT) processor using 0.6 m gallium arsenide (GaAs) technology are presented. This processor computes a 1024-point FFT of 16 bit complex data in less than 8 s, working at a frequency beyond 700 MHz, with a power consumption of 12.5 W. The architecture of the processor is based on the COordinate Rotation ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010